Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS
نویسنده
چکیده
We show that the vertex visited last by a LexBFS has eccentricity at least diam(G) − 2 for house-hole-free graphs, at least diam(G) − 1 for house-hole-domino-free graphs, and equal to diam(G) for house-hole-domino-free and AT-free graphs. To prove these results we use special metric properties of house-hole-free graphs with respect to LexBFS. ? 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Diameter Determination on Restricted Graph Faminlies
Determining the diameter of a graph is a fundamental graph operation, yet no e/cient (i.e. linear or quadratic time) algorithm is known. In this paper, we examine the diameter problem on chordal graphs and AT-free graphs and show that a very simple (linear time) 2-sweep LexBFS algorithm identi9es a vertex of maximum eccentricity unless the given graph has a speci9ed induced subgraph (it was pre...
متن کاملA New Graph Parameter to Measure Linearity
Since its introduction to recognize chordal graphs by Rose, Tarjan, and Lueker, Lexicographic Breadth First Search (LexBFS) has been used to come up with simple, often linear time, algorithms on various classes of graphs. These algorithms, called multi-sweep algorithms, compute a number of LexBFS orderings σ1, . . . , σk, where σi is used to break ties for σi+1, we write LexBFS (σi) = σi+1. For...
متن کاملLexBFS-Ordering in Asteroidal Triple-Free Graphs
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...
متن کاملLexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem
For an undirected graph G the kth power G of G is the graph with the same vertex set as G where two vertices are adjacent i their distance is at most k in G. In this paper we prove that every LexBFS-ordering of a distance-hereditary graph is both a common perfect elimination ordering of all even powers and a common semi-simplicial ordering of all powers of this graph. Moreover, we characterize ...
متن کاملEfficiently recognizing, decomposing and triangulating hole- and diamond-free graphs
We show that the atoms by clique separator decomposition of holeand diamond-free graphs are of three simple types: clique, matched co-bipartite or chordal bipartite. We present an O(n) time algorithm to recognize these graphs and decompose them into atoms, whereas this decomposition requires O(nm) time for almost all graph classes. To ensure this good time bound, we use algorithm LexBFS in a no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 95 شماره
صفحات -
تاریخ انتشار 1999